Integer flows and cycle covers
نویسندگان
چکیده
منابع مشابه
Integer flows and cycle covers
Results related to integer flows and cycle covers are presented. A cycle cover of a graph G is a collection %Y of cycles of G which covers all edges of G; U is called a cycle m-cover of G if each edge of G is covered exactly m times by the members of V. By using Seymour’s nowhere-zero 6-flow theorem, we prove that every bridgeless graph has a cycle 6-cover associated to covering of the edges by...
متن کاملPath Partitions, Cycle Covers and Integer Decomposition
A polyhedron P has the integer decomposition property, if every integer vector in kP is the sum of k integer vectors in P . We explain that the projections of polyhedra defined by totally unimodular constraint matrices have the integer decomposition property, in order to deduce the same property for coflow polyhedra defined by Cameron and Edmonds. We then apply this result to the convex hull of...
متن کاملFlows, flow-pair covers and cycle double covers
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, DiscreteMath. 244 (2002) 77–82] about edge-disjoint bipartizingmatchings of a cubic graphwith a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D, f1) and (D, f2)...
متن کاملVector Flows and Integer Flows
A vector Sd-flow is a flow whose flow values are vectors in Sd, where Sd is the set of all unit vectors in Rd+1. Jain [Open Problem Garden, http://www.openproblemgarden.org/op/unit vector flows (2007)] and Thomassen [J. Combin. Theory Ser. B., 108 (2014), pp. 81–91] proved that a graph has a vector S1-flow if it has a nowhere-zero integer 3-flow. Thomassen [J. Combin. Theory Ser. B., 108 (2014)...
متن کاملPostman tours and cycle covers
Raspaud, A., Postman tours and cycle covers, Discrete Mathematics 111 (1993) 447-454. Let G be a bridgeless graph. We show that the length of a shortest postman tour is at most IF(G)1 + 1 k’(G)1 3 and that, if G is a minimally 2-edge connected graph, then the length is at most 21 V(G)l-2. We then deduce results concerning the length of a shortest cycle cover for graphs containing no subdivision...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1992
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90069-a